Sort and Deep-SORT Based Multi-Object Tracking for Mobile Robotics: Evaluation with New Data Association Metrics

نویسندگان

چکیده

Multi-Object Tracking (MOT) techniques have been under continuous research and increasingly applied in a diverse range of tasks. One area particular concerns its application navigation tasks assistive mobile robots, with the aim to increase mobility autonomy people suffering from decay, or severe motor impairments, due muscular, neurological, osteoarticular decay. Therefore, this work, having view for an evaluation study two MOTs by detection algorithms, SORT Deep-SORT, is presented. To improve data association both methods, which are solved as linear assignment problem generated cost matrix, set new object tracking matrices based on intersection over union, Euclidean distances, bounding box metrics proposed. For MOT real-time pipeline, YOLOv3 used detect classify objects available images. In addition, perform proposed aiming at platforms, ISR dataset, represents conditions real robotic platforms may navigate, Experimental evaluations were also carried out MOT17 dataset. Promising results achieved matrices, showing improvement majority compared default matrix. promising frame rate values attained pipeline composed detector module.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FPGA-based Accelerators for Parallel Data Sort

The paper is dedicated to parallel data sort based on sorting networks. The proposed methods and circuits have the following characteristics: 1) using two-level parallel comparators in even-odd transition networks with feedback to a register keeping input/intermediate data; 2) parallel merging of many sorted sequences; 3) using even-odd transition networks built from other sorting networks; 4) ...

متن کامل

Sort Me If You Can: How to Sort Dynamic Data

We formulate and study a new computational model for dynamic data. In this model the data changes gradually and the goal of an algorithm is to compute the solution to some problem on the data at each time step, under the constraint that it only has a limited access to the data each time. As the data is constantly changing and the algorithm might be unaware of these changes, it cannot be expecte...

متن کامل

Novel and Generalized Sort-Based Transform for Lossless Data Compression

We propose a new sort-based transform for lossless data compression that can replace the BWT transform in the block-sorting data compression algorithm. The proposed transform is a parametric generalization of the BWT and the RadixZip transform proposed by Vo and Manku (VLDB, 2008), which is a rather new variation of the BWT. For a class of parameters, the transform can be performed in time line...

متن کامل

Comparison of Bucket Sort and RADIX Sort

Bucket sort and RADIX sort are two well-known integer sorting algorithms. This paper measures empirically what is the time usage and memory consumption for different kinds of input sequences. The algorithms are compared both from a theoretical standpoint but also on how well they do in six different use cases using randomized sequences of numbers. The measurements provide data on how good they ...

متن کامل

A New Efficient Radix Sort

We present new improved algorithms for the sorting problem. The algorithms are not only efficient but also clear and simple. First, we introduce Forward Radix Sort which combines the advantages of traditional left-to-right and right-to-left radix sort in a simple manner. We argue that this algorithm will work very well in practice. Adding a preprocessing step, we obtain an algorithm with attrac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app12031319